منابع مشابه
Towards Meta-Reasoning in the Concurrent Logical Framework CLF
The concurrent logical framework CLF is an extension of the logical framework LF designed to specify concurrent and distributed languages. While it can be used to define a variety of formalisms, reasoning about such languages within CLF has proved elusive. In this paper, we propose an extension of LF that allows us to express properties of CLF specifications. We illustrate the approach with a p...
متن کاملCLF: A Dependent Logical Framework for Concurrent Computations∗
We present CLF, a dependently typed logical framework with several novel features supporting concurrent computations, in particular monads and synchronous linear connectives. We illustrate its representation methodology of concurrent computations as monadic expressions via the encoding of an asynchronous π-calculus with correspondence assertions, including its dynamic semantics, safety criterio...
متن کاملMode checking in the Concurrent Logical Framework
We define and prove correct a mode checker for a significant fragment of the concurrent logical framework CLF. ∗ This paper was made possible by grant 09-1107-1-168, Formal Reasoning about Languages for Distributed Computation, from the Qatar National Research Fund (a member of the Qatar Foundation). The statements made herein are solely the responsibility of the authors.
متن کاملTowards a Logical Framework for Reasoning about Risk
Evaluating the effectiveness of the security measures undertaken to protect a distributed system (e.g., protecting privacy of data in a network or in an information system) is a difficult task that, among other things, requires a risk assessment. We introduce a logical framework that allows one to reason about risk by means of operators that formalize causes, effects, preconditions, prevention ...
متن کاملA Concurrent Logical Framework: The Propositional Fragment
We present the propositional fragment CLF0 of the Concurrent Logical Framework (CLF). CLF extends the Linear Logical Framework to allow the natural representation of concurrent computations in an object language. The underlying type theory uses monadic types to segregate values from computations. This separation leads to a tractable notion of definitional equality that identifies computations d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.120.2